package com.linwen.excise.leetcode;

/**
 * @ClassName _37二进制求和
 * @Description TODO
 * @Author zero
 * @DATE 2024/10/7 3:29 PM
 * @Version 1.0
 */
public class _67二进制求和 {
    public static void main(String[] args) {
        _67二进制求和 inst = new _67二进制求和();
        System.out.println(inst.addBinary("11","1"));
    }
    public String addBinary(String a, String b) {
        int index = Math.max(a.length(),b.length());
        StringBuffer sb = new StringBuffer();
        for (int i = index-1; i >=0 ; i--) {

            char aChar = a.charAt(i);
            char bChar = b.charAt(i);

        }
        return "";
    }
}
